2,338 research outputs found
A triangle of dualities: reversibly decomposable quantum channels, source-channel duality, and time reversal
Two quantum information processing protocols are said to be dual under
resource reversal if the resources consumed (generated) in one protocol are
generated (consumed) in the other. Previously known examples include the
duality between entanglement concentration and dilution, and the duality
between coherent versions of teleportation and super-dense coding. A quantum
feedback channel is an isometry from a system belonging to Alice to a system
shared between Alice and Bob. We show that such a resource may be reversibly
decomposed into a perfect quantum channel and pure entanglement, generalizing
both of the above examples. The dual protocols responsible for this
decomposition are the ``feedback father'' (FF) protocol and the ``fully quantum
reverse Shannon'' (FQRS) protocol. Moreover, the ``fully quantum Slepian-Wolf''
protocol (FQSW), a generalization of the recently discovered ``quantum state
merging'', is related to FF by source-channel duality, and to FQRS by time
reversal duality, thus forming a triangle of dualities. The source-channel
duality is identified as the origin of the previously poorly understood
``mother-father'' duality. Due to a symmetry breaking, the dualities extend
only partially to classical information theory.Comment: 5 pages, 5 figure
Quantum information can be negative
Given an unknown quantum state distributed over two systems, we determine how
much quantum communication is needed to transfer the full state to one system.
This communication measures the "partial information" one system needs
conditioned on it's prior information. It turns out to be given by an extremely
simple formula, the conditional entropy. In the classical case, partial
information must always be positive, but we find that in the quantum world this
physical quantity can be negative. If the partial information is positive, its
sender needs to communicate this number of quantum bits to the receiver; if it
is negative, the sender and receiver instead gain the corresponding potential
for future quantum communication. We introduce a primitive "quantum state
merging" which optimally transfers partial information. We show how it enables
a systematic understanding of quantum network theory, and discuss several
important applications including distributed compression, multiple access
channels and multipartite assisted entanglement distillation (localizable
entanglement). Negative channel capacities also receive a natural
interpretation
Nonadditivity effects in classical capacities of quantum multiple-access channels
We study classical capacities of quantum multi-access channels in geometric
terms revealing breaking of additivity of Holevo-like capacity. This effect is
purely quantum since, as one points out, any classical multi-access channels
have their regions additive. The observed non-additivity in quantum version
presented here seems to be the first effect of this type with no additional
resources like side classical or quantum information (or entanglement)
involved. The simplicity of quantum channels involved resembles butterfly
effect in case of classical channel with two senders and two receivers.Comment: 5 pages, 5 figure
Tema Con Variazioni: Quantum Channel Capacity
Channel capacity describes the size of the nearly ideal channels, which can
be obtained from many uses of a given channel, using an optimal error
correcting code. In this paper we collect and compare minor and major
variations in the mathematically precise statements of this idea which have
been put forward in the literature. We show that all the variations considered
lead to equivalent capacity definitions. In particular, it makes no difference
whether one requires mean or maximal errors to go to zero, and it makes no
difference whether errors are required to vanish for any sequence of block
sizes compatible with the rate, or only for one infinite sequence.Comment: 32 pages, uses iopart.cl
Symmetry implies independence
Given a quantum system consisting of many parts, we show that symmetry of the
system's state, i.e., invariance under swappings of the subsystems, implies
that almost all of its parts are virtually identical and independent of each
other. This result generalises de Finetti's classical representation theorem
for infinitely exchangeable sequences of random variables as well as its
quantum-mechanical analogue. It has applications in various areas of physics as
well as information theory and cryptography. For example, in experimental
physics, one typically collects data by running a certain experiment many
times, assuming that the individual runs are mutually independent. Our result
can be used to justify this assumption.Comment: LaTeX, contains 4 figure
Multiplicativity of completely bounded p-norms implies a new additivity result
We prove additivity of the minimal conditional entropy associated with a
quantum channel Phi, represented by a completely positive (CP),
trace-preserving map, when the infimum of S(gamma_{12}) - S(gamma_1) is
restricted to states of the form gamma_{12} = (I \ot Phi)(| psi >< psi |). We
show that this follows from multiplicativity of the completely bounded norm of
Phi considered as a map from L_1 -> L_p for L_p spaces defined by the Schatten
p-norm on matrices; we also give an independent proof based on entropy
inequalities. Several related multiplicativity results are discussed and
proved. In particular, we show that both the usual L_1 -> L_p norm of a CP map
and the corresponding completely bounded norm are achieved for positive
semi-definite matrices. Physical interpretations are considered, and a new
proof of strong subadditivity is presented.Comment: Final version for Commun. Math. Physics. Section 5.2 of previous
version deleted in view of the results in quant-ph/0601071 Other changes
mino
Strong Secrecy for Multiple Access Channels
We show strongly secret achievable rate regions for two different wiretap
multiple-access channel coding problems. In the first problem, each encoder has
a private message and both together have a common message to transmit. The
encoders have entropy-limited access to common randomness. If no common
randomness is available, then the achievable region derived here does not allow
for the secret transmission of a common message. The second coding problem
assumes that the encoders do not have a common message nor access to common
randomness. However, they may have a conferencing link over which they may
iteratively exchange rate-limited information. This can be used to form a
common message and common randomness to reduce the second coding problem to the
first one. We give the example of a channel where the achievable region equals
zero without conferencing or common randomness and where conferencing
establishes the possibility of secret message transmission. Both coding
problems describe practically relevant networks which need to be secured
against eavesdropping attacks.Comment: 55 page
- …